n = int(input())
arr = list(map(int,input().split()))
arr.sort()
print(arr[n//2])
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define le (node<<1)
#define ri (node<<1|1)
#define mid ((l+r)>>1)
using namespace std;
const int N = 1e6+6 ;
const int M = 1e9+7 ;
const int oo = 1e18 ;
signed main()
{
//freopen( ".in" , "r" , stdin ) ;
//freopen( ".out" , "w" , stdout ) ;
fast ;
int n ;
cin >> n ;
int a[n] ;
for ( int i = 0 ; i < n ; i++ ) cin >> a[i] ;
sort ( a , a+n ) ;
cout << a[n/2] ;
//Plus_Ultra
return 0 ;
}
749A - Bachgold Problem | 1486B - Eastern Exhibition |
1363A - Odd Selection | 131B - Opposites Attract |
490C - Hacking Cypher | 158B - Taxi |
41C - Email address | 1373D - Maximum Sum on Even Positions |
1574C - Slay the Dragon | 621A - Wet Shark and Odd and Even |
1395A - Boboniu Likes to Color Balls | 1637C - Andrew and Stones |
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |